Stabilizing quantum information

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stabilizing Quantum Information

The algebraic structure underlying all the schemes for quantum information stabilization is argued to be fully contained in the reducibility of the operator algebra describing the interaction with the environment of the coding quantum system. This property amounts to the existence of a non-trivial group of symmetries for the global dynamics. We provide a unified framework which allows us to bui...

متن کامل

Stabilizing Feedback Controls for Quantum Systems

No quantum measurement can give full information on the state of a quantum system; hence any quantum feedback control problem is necessarily one with partial observations and can generally be converted into a completely observed control problem for an appropriate quantum filter as in classical stochastic control theory. Here we study the properties of controlled quantum filtering equations as c...

متن کامل

Distance-two information in self-stabilizing algorithms

In the state-based self-stabilizing algorithmic paradigm for distributed computing, each node has only a local view of the system (seeing its neighbors’ states), yet in a finite amount of time the system converges to a global state satisfying some desired property. In this paper we introduce a general mechanism that allows a node to act only on correct distance-two knowledge, provided there are...

متن کامل

Stabilizing Boolean Games by Sharing Information

We address the issue of manipulating games through communication. In the specific setting we consider (a variation of Boolean games), we assume there is some set of environment variables, the values of which are not directly accessible to players; the players have their own beliefs about these variables, and make decisions about what actions to perform based on these beliefs. The communication ...

متن کامل

Distance-k Information in Self-stabilizing Algorithms

Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisions based on the states of their immediate neighbors. We provide a general polynomial transformation for constructing self-stabilizing algorithms which utilize distancek knowledge, with a slowdown of n . Our main application is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2000

ISSN: 1050-2947,1094-1622

DOI: 10.1103/physreva.63.012301